Algebraic Higher-Order Matching
نویسنده
چکیده
The decidability of algebraic higher-order matching is proved. Algebraic higher-order matching is a matching where the constant term in equation is built of first-order constants and constants of a base type. This result is particularly appealing in the light of the last result of Loader.
منابع مشابه
Algebraic Matching of Vulnerabilities in a Low-Level Code
This paper explores the algebraic matching approach for detection of vulnerabilities in binary codes. The algebraic programming system is used for implementing this method. It is anticipated that models of vulnerabilities and programs to be verified are presented as behavior algebra and action language specifications. The methods of algebraic matching are based on rewriting rules and techniques...
متن کاملImperative abstractions for functional actions
We elaborate our relational model of non-strict, imperative computations. The theory is extended to support infinite data structures. To facilitate their use in programs, we extend the programming language by concepts such as procedures, parameters, partial application, algebraic data types, pattern matching and list comprehensions. For each concept, we provide a relational semantics. Abstracti...
متن کاملSAT Compilation for Constraints over Finite Structured Domains
Due to the availability of powerful SAT solvers, propositional encoding is a successful technique of solving constraint systems over finite domains. As these domains are often flat and non-structured, the CO4 compiler aims to extend this concept by enriching the underlying domain with user-defined algebraic data types. Syntactically, CO4 is a subset of Haskell and allows to specify constraint s...
متن کاملPropositional Encoding of Constraints over Tree-Shaped Data
The paper presents a high-level declarative language CO4 for describing constraint systems. The language includes user-defined algebraic data types and recursive functions defined by pattern matching, as well as higher-order and polymorphic types. This language comes with a compiler that transforms a high-level constraint system into a satisfiability problem in propositional logic. This is moti...
متن کاملGeometric Polynomial Constraints in Higher-Order Graph Matching
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing affinities beyond the unary and pairwise level. Such higher-order terms have a particular appeal for geometric constraints that include three or more corresponden...
متن کامل